Search results for "Approximation theory"

On Erlang B-formula and ERT method extension

2010

The key result of the paper is the theorem on traffic splitting and the ERT method extension for estimation of the throughput for schemes with traffic splitting. The excellent accuracy (relative error is less than 1%) is shown in numerical example. The paper also contains new Erlang-B formula algorithm for non-integer number of channels based on parabolic approximation.

Influence of Active Device Nonlinearities on the Determination of Adler's Injection.Locking Q-Factor

2011

The problem of the correct evaluation of Q-factor appearing in Adler's equation for injection-locking is addressed. Investigation has shown that recent results presented in the literature, while extending applicability of the original method, do not completely account for nonlinear effects occurring when two-port active devices are involved. To overcome such limitation, use can be made of a newly developed theory in the dynamical complex envelope domain, capable of providing first-approximation exact dynamical models of driven quasi-sinusoidal oscillators. Some preliminary results are presented here concerning a class of injection-locked oscillators with single-loop feedback type configurat…

On spline methods of approximation under L-fuzzy information

2011

This work is closely related to our previous papers on algorithms of approximation under L-fuzzy information. In the classical theory of approximation central algorithms were worked out on the basis of usual, that is crisp splines. We describe central methods for solution of linear problems with balanced L-fuzzy information and develop the concept of L-fuzzy splines.

Finite element approximation of parabolic hemivariational inequalities

1998

In this paper we introduce a finite element approximation for a parabolic hemivariational initial boundary value problem. We prove that the approximate problem is solvable and its solutions converge on subsequences to the solutions of the continuous problem

Real-time clothoid approximation by Rational Bezier curves

2008

This paper presents a novel technique for implementing Clothoidal real-time paths for mobile robots. As first step, rational Bezier curves are obtained as approximation of the Fresnel integrals. By rescaling, rotating and translating the previously computed RBC, an on-line Clothoidal path is obtained. In this process, coefficients, weights and control points are kept invariant. This on-line approach guarantees that an RBC has the same behavior as the original Clothoid using a low curve order. The resulting Clothoidal path allows any two arbitrary poses to be joined in a plane. RBCs working as Clothoids are also used to search for the shortest bounded-curvature path with a significant comput…

Reduced complexity models in the identification of dynamical networks: Links with sparsification problems

2009

In many applicative scenarios it is important to derive information about the topology and the internal connections of more dynamical systems interacting together. Examples can be found in fields as diverse as Economics, Neuroscience and Biochemistry. The paper deals with the problem of deriving a descriptive model of a network, collecting the node outputs as time series with no use of a priori insight on the topology. We cast the problem as the optimization of a cost function operating a trade-off between accuracy and complexity in the final model. We address the problem of reducing the complexity by fixing a certain degree of sparsity, and trying to find the solution that “better” satisfi…

An asymptotic approximate solution to the distribution of the capacity outage intervals in OSTBC-MIMO Rayleigh fading channels

2013

This paper deals with the study of asymptotic probability density functions (PDFs) of the outage durations of the instantaneous capacity (also referred to as the mutual information) in orthogonal space-time block code (OSTBC) transceiver systems over multiple-input multiple-output (MIMO) Rayleigh fading channels. The Rayleigh fading subchannels are assumed to be frequency-nonselective and mutually uncorrelated, whereas the associated Doppler power spectral density is supposed to be symmetric about the origin. In addition, the channel state information (CSI) is considered to be available only at the receiver side. Taking these assumptions into account, and drawing upon known statistical prop…

How Low Can Approximate Degree and Quantum Query Complexity Be for Total Boolean Functions?

2012

It has long been known that any Boolean function that depends on n input variables has both degree and exact quantum query complexity of Omega(log n), and that this bound is achieved for some functions. In this paper we study the case of approximate degree and bounded-error quantum query complexity. We show that for these measures the correct lower bound is Omega(log n / loglog n), and we exhibit quantum algorithms for two functions where this bound is achieved.

Matemātika

1994

The Use of the Wavelet Approximation Signal as a Tool for the Diagnosis of Rotor Bar Failures

2005

[EN] The aim of this paper is to present a new approach for rotor bar failure diagnosis in induction machines. The method focuses on the study of an approximation signal resulting from the wavelet decomposition of the startup stator current. The presence of the left sideband harmonic is used as evidence of the rotor failure in most diagnosis methods based on the analysis of the stator current. Thus, a detailed description of the evolution of the left sideband harmonic during the startup transient is given in this paper; for this purpose, a method for calculating the evolution of the left sideband during the startup is developed, and its results are physically explained. This paper also show…